#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 1e7 + 5;

int n, m;
bool vis[N];
int primes[N], tot;
int ans[N];
void init(int n) {
  vis[1] = 1, ans[1] = 1;
  rep(i, 2, n) {
    if (!vis[i]) primes[++tot] = i, ans[i] = 2;
    rep(j, 1, tot) {
      ll k = 1ll * primes[j] * i;
      if (k > n) break;
      vis[k] = 1;
      ll x = k, y = 0;
      while (x % primes[j] == 0) x /= primes[j], y++;
      ans[k] = (y + 1) * ans[x];
      if (i % primes[j] == 0) break;
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  init(1e7);
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    cout << ans[n] << endl;
  }
  return 0;
}
